On the Generality of Binary Tree-like Markov Chains
نویسنده
چکیده
In this paper we show that an arbitrary tree-like Markov chain can be embedded in a binary tree-like Markov chain with a special structure. When combined with [7], this implies that any tree structured QBD Markov chain can be reduced to a binary tree-like process. Furthermore, a simple relationship between the V , Rs and Gs matrices of the original and the binary tree-like Markov chain is established. We also explore the effectiveness of computing the steady state probabilities from the reduced binary chain.
منابع مشابه
Taylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملSome limit results for Markov chains indexed by trees *
We consider a sequence of Markov chains (X)n=1,2,... with X = (X σ )σ∈T , indexed by the full binary tree T = T0 ∪ T1 ∪ . . . , where Tk is the k-th generation of T . In addition, let (Σk)k=0,1,2,... be a random walk on T with Σk ∈ Tk and R̃ = (R̃ t )t≥0 with R̃ t := XΣ[tn] , arising by observing the Markov chain X n along the random walk. We present a law of large numbers concerning the empirical...
متن کاملOn the link between Markovian trees and tree-structured Markov chains
In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-anddeath processes (TLQBD) by associating a specific TLQBD to each MBT. The algorithms to compute the matrices Gk in the TLQBD then correspond to the algorithms calculating the extinction probability vector of the MBT. This parallelism leads to a new quadratic algorithm, based on the Newton iteratio...
متن کاملTrickle-down Processes and Their Boundaries
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in one-byone at a distinguished source vertex, successive particles proceed along directed edges according to an appropriate stochastic mechanism, and each par...
متن کامل